Distribution of nearest neighbors in dilute suspensions of monodisperse spheres.
نویسندگان
چکیده
منابع مشابه
Degree distribution and scaling in the Connecting Nearest Neighbors model
We present a detailed analysis of the connecting-nearest-neighbors model by Vázquez [Phys. Rev. E 67, 056104 (2003)]. We show that the degree distribution follows a power law, but the scaling exponent can vary with the parameter setting. Moreover, the correspondence of the growing version of the connecting-nearest-neighbors model to the particular random walk model and recursive search model is...
متن کاملSuspensions of homology spheres
This article is one of three highly influential articles on the topology of manifolds written by Robert D. Edwards in the 1970’s but never published. This article “Suspensions of homology spheres” presents the initial solutions of the fabled Double Suspension Conjecture. The article “Approximating certain cell-like maps by homeomorphisms” presents the definitive theorem on the recognition of ma...
متن کاملNearest-neighbors medians clustering
We propose a nonparametric cluster algorithm based on local medians. Each observation is substituted by its local median and this new observation moves toward the peaks and away from the valleys of the distribution. The process is repeated until each observation converges to a fixpoint. We obtain a partition of the sample based on the convergence points. Our algorithm determines the number of c...
متن کاملSingle Average Magnetization, Staggered Symmetry, and next Nearest Neighbors in Dilute Systems
The usual mean field treatment of dilute antiferromagnets in a uniform field considers two sublattice magnetizations and yields a continuous transition. On the opposite, starting with one single average magnetization produces a tricritical point. This apparent discrepancy is explained by showing that a single magnetization approach does indeed account for the staggered symmetry but also simulta...
متن کاملBoruvka Meets Nearest Neighbors
Computing the minimum spanning tree (MST) is a common task in the pattern recognition and the computer vision fields. However, little work has been done on efficient general methods for solving the problem on large datasets where graphs are complete and edge weights are given implicitly by a distance between vertex attributes. In this work we propose a generic algorithm that extends the classic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JOURNAL OF CHEMICAL ENGINEERING OF JAPAN
سال: 1996
ISSN: 0021-9592,1881-1299
DOI: 10.1252/jcej.29.416